METHOD OF MINIMIZING BOOLEAN FUNCTIONS FOR DESIGNING DIGITAL COMBINATIONAL CIRCUITS

The article discusses a two-stage method of minimizing Boolean functions for designing digital combinational circuits. At the first stage, search simple conjuncterms is carried out by bitwise division set initial conjuncterms. this way tautology does not appear, low-rank are found without intermediate gluing. second minimal performed chain coverage table In cyclic part, fragments found, which quite simple. To reduce computational load at branching points chains, decision can be made about entering or removing corresponding conjuncterm from finite based on calculation complexity factor in vicinity branching. proposed heuristic.